TOWARDS STRING PREDICTIONS
نویسندگان
چکیده
منابع مشابه
Towards String Predictions
The aim of superstring phenomenology is to develop the tools and methodology needed to confront string theory with experimental data. The first mandatory task is to find string solutions which reproduce the observable data. The subsequent goal is to extract potential signatures beyond the observable data. Recently, by studying exact flat directions of non–Abelian singlet fields, we demonstrated...
متن کاملString theory predictions for future accelerators
We consider, in a string theory framework, physical processes of phenomenological interest in models with a low string scale. The amplitudes we study involve tree-level virtual gravitational exchange, divergent in a field-theoretical treatment, and massive gravitons emission, which are the main signatures of this class of models. First, we discuss the regularization of summations appearing in v...
متن کاملTowards Faster String Matching
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Hannu Peltola Name of the doctoral dissertation Towards Faster String Matching Publisher Aalto University School of Science Unit Department of Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 78/2013 Field of research Software Technology Manuscript submitted 11 December 2012 Date of the defenc...
متن کاملTowards a Topological G2 String
We define new topological theories related to sigma models whose target space is a 7 dimensional manifold of G2 holonomy. We show how to define the topological twist and identify the BRST operator and the physical states. Correlation functions at genus zero are computed and related to Hitchin’s topological action for three-forms. We conjecture that one can extend this definition to all genus an...
متن کاملTowards optimal packed string matching
In the packed string matching problem, it is assumed that each machine word can accommodate up to α characters, thus an n-character string occupies n/α memory words. (a) We extend the Crochemore-Perrin constant-spaceO(n)-time string matching algorithm to run in optimal O(n/α) time and even in real-time, achieving a factor α speedup over traditional algorithms that examine each character individ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics A
سال: 2001
ISSN: 0217-751X,1793-656X
DOI: 10.1142/s0217751x01004918